منابع مشابه
Recursive Types
Vladimir Gapeyev Michael Y. Levin Benjamin C. Pierce Department of Computer and Information Science University of Pennsylvania fvgapeyev,bcpierce,[email protected] Category: Pearls Abstract Algorithms for checking subtyping between recursive types lie at the core of many modern programming language implementations. But the fundamental theory of these algorithms and how they relate to simpl...
متن کاملGames for Recursive Types
We present results concerning the solution of recursive domain equations in the category G of games, which is a modiied version of the category presented in AJM94]. New constructions corresponding to lifting and separated sum for games are presented, and are used to generate games for two simple recursive types: the vertical and lazy natural numbers. Recently, the \game semantics" paradigm has ...
متن کاملRecursive Session Types Revisited
Session types model structured communication-based programming. In particular, binary session types for the πcalculus describe communication between exactly two participants in a distributed scenario. Adding sessions to the πcalculus means augmenting it with type and term constructs. In a previous paper, we tried to understand to which extent the session constructs are more complex and expressi...
متن کاملSubtyping with Union Types, Intersection Types and Recursive Types II
This paper is a follow-up on previous work by the author on subtyping with (set-theoretic) union, intersection and recursive types. Previously, it was shown how types may be encoded as regular tree expressions/set constraints. This gave rise to a sound and complete decision procedure for type inclusion. The result was, however, limited to a rather speciic type language. In the work reported on ...
متن کاملSubtyping with Union Types, Intersection Types and Recursive Types
This paper is a follow-up on previous work by the author on sub-typing with (set-theoretic) union, intersection and recursive types. Previously, it was shown how types may be encoded as regular tree expressions/set constraints. This gave rise to a sound and complete decision procedure for type inclusion. The result was, however, limited to a rather speciic type language. In the work reported on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1969
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1969-0239973-6